Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.Comment: 8 pages, 4 figures, 1 tabl

A Multiobjective Optimization Framework for Routing in Wireless Ad Hoc Networks

Wireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design tradeoffs in such networks. The aim of this paper is not to propose another routing strategy. Instead, we address this problem by proposing a new modeling framework for routing in ad hoc networks, which will result in a better understanding of network behavior and performance when multiple criteria are relevant. Our approach is to take a holistic view of the network that captures the cross-interactions among interference management techniques implemented at various layers of the protocol stack. The resulting framework is a complex multiobjective optimization problem that can be solved through existing multiobjective search techniques. In this contribution, we present the Pareto optimal sets for an example sensor network when delay, robustness and energy are considered

A Multiobjective Performance Evaluation Framework for Routing in Wireless Ad Hoc Networks

RoutingInternational audienceWireless ad hoc networks are seldom characterized by one single performance metric, yet the current literature lacks a flexible framework to assist in characterizing the design tradeoffs in such networks. The aim of this paper is not to propose another routing strategy. Instead, we address this problem by proposing a new modeling framework for routing in ad hoc networks, which will result in a better understanding of network behavior and performance when multiple criteria are relevant. Our approach is to take a holistic view of the network that captures the cross-interactions among interference management techniques implemented at various layers of the protocol stack. The resulting framework is a complex multiob- jective optimization problem that can be solved through existing multiobjective search techniques. In this contribution, we present the Pareto optimal sets for an example sensor network when delay, robustness and energy are considered

A Cross-layer Framework for Multiobjective Performance Evaluation of Wireless Ad Hoc Networks

International audienceIn this paper we address the problem of finding the optimal performance region of a wireless ad hoc network when multiple performance metrics are considered. Our contribution is to propose a novel cross-layer framework for deriving the Pareto optimal performance bounds for the network. These Pareto bounds provide key information for understanding the network behavior and the performance trade-offs when multiple criteria are relevant. Our approach is to take a holistic view of the network that captures the cross-interactions among interference management techniques implemented at various layers of the protocol stack (e.g. routing and resource allocation) and determines the objective functions for the multiple criteria to be optimized. The resulting complex multiobjective optimization problem is then solved by multiobjective search techniques. The Pareto optimal sets for an example sensor network are presented and analyzed when delay, reliability and energy objectives are considered

Modeling Opportunistic Data Delivery in Dynamic Wireless Networks

International audienceIn this work we examine data delivery in dynamic wireless ad hoc networks that exchange packets opportunistically. Legacy mobile ad hoc network (MANET) protocols send packets along a predetermined path between a source and a destination. Node mobility, however, may create network partitions and a multi-hop link may not be present at the onset. Such node mobility may instead be leveraged to create an asynchronous path between a source and destination enabling opportunistic message exchange. In this work we propose an analytic model for this data exchange by defining a node's probability to forward packets to an encountered node. Drawing on results from mobility studies, we derive the statistics on the packet exchange and packet delivery performance for opportunistic networks. This model is validated for several simulation scenarios. The work provides a foundation for a one-to-one performance comparison of existing opportunistic forwarding protocols